On the Capacity Region of the Deterministic Y-Channel with Common and Private Messages

In this paper, we discuss the capacity region of the deterministic Y-channel with private and common messages. Each user aims to deliver two private messages to the other two users in addition to a common message directed towards both of them. As there is no direct link between the users, all messages must pass through the relay. We present outer-bounds on the rate region using genie aided and cut-set bounds. Then, we define an achievable region and show that at a certain number of levels at the relay, our achievable region coincides with the upper bound. Finally, we argue that these bounds for this setup are not sufficient to characterize the capacity region.